Feasibility Studies for Programming in Natural Language

نویسندگان

  • Henry Lieberman
  • Hugo Liu
چکیده

We think it is time to take another look at an old dream -that one could program a computer by speaking to it in natural language. Programming in natural language might seem impossible, because it would appear to require complete natural language understanding and dealing with the vagueness of human descriptions of programs. But we think that several developments might now make programming in natural language feasible. First, improved broad coverage natural language parsers and semantic extraction techniques permit partial understanding. Second, mixed-initiative dialogues can be used for meaning disambiguation. And finally, where direct understanding techniques fail, we hope to fall back on Programming by Example, and other techniques for specifying the program in a more fail-soft manner. To assess the feasibility of this project, as a first step, we are studying how non-programming users describe programs in unconstrained natural language. We are exploring how to design dialogs that help the user make precise their intentions for the program, while constraining them as little as possible.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NLP (Natural Language Processing) for NLP (Natural Language Programming)

Natural Language Processing holds great promise for making computer interfaces that are easier to use for people, since people will (hopefully) be able to talk to the computer in their own language, rather than learn a specialized language of computer commands. For programming, however, the necessity of a formal programming language for communicating with a computer has always been taken for gr...

متن کامل

Context–free grammar induction using evolutionary methods

The research into the ability of building self-learning natural language parser based on context–free grammar (CFG ) was presented. The paper investigates the use of evolutionary methods: a genetic algorithm, a genetic programming and learning classifier systems for inferring CFG based parser. The experiments were conducted on the real set of natural language sentences. The gained results confi...

متن کامل

A Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations

In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...

متن کامل

A New Combination of Robust-possibilistic Mathematical Programming for Resilient Supply Chain Network under Disruptions and Uncertainty: A Real Supply Chain (RESEARCH NOTE)

Nowadays, the design of a strategic supply chain network under disruption is one of the most important priorities of the governments. One of the strategic purposes of managers is to supply the sustainable agricultural products and food in stable conditions which require the production of soil nutrients. In this regard, some disruptions such as sanctions and natural disasters have a destructive ...

متن کامل

Consistency of stochastic context-free grammars

Computational linguistics play an important role in modeling various applications. Stochastic context-free grammars (SCFGs), for instance, are widely used in compiler testing, natural language processing (NLP), speech recognition and bioinformatics. The commonality of the former projects is that all require consistent SCFGs. This article addresses the consistency problem of SCFGs. We introduce ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006